Constructing common base domain by cues from Voronoi diagram
نویسندگان
چکیده
In this paper, we propose a novel algorithm to construct common base domains for cross-parameterization constrained by anchor points. Based on the common base domains, a bijective mapping between given models can be established. Experimental results show that the distortion in a cross-parameterization generated on our common base domains is much smaller than that of a mapping on domains constructed by prior methods. Different from prior algorithms that generate domains by a heuristic of having higher priority to link the shortest paths between anchor points, we compute the surface Voronoi diagram of anchor points to find out the initial connectivity for the base domains. The final common base domains can be efficiently generated from the initial connectivity. The Voronoi diagram of the anchor points gives better cues than the heuristic of connecting shortest paths greedily, therefore resulting in an efficient and reliable algorithm for construction of common base domains that bring to low distortion in constrained cross-parameterization.
منابع مشابه
Voronoi diagram and medial axis algorithm for planar domains with curved boundaries I. Theoretical foundations
In this rst installment of a two-part paper, the underlying theory for an algorithm that computes the Voronoi diagram and medial axis of a planar domain bounded by free-form (polynomial or rational) curve segments is presented. An incremental approach to computing the Voronoi diagram is used, wherein a single boundary segment is added to an existing boundary-segment set at each step. The introd...
متن کاملConstructing Area Voronoi Diagram Based on Direct Calculation of the Freeman Code of Expanded Contours
A Voronoi diagram of image elements provides an intuitive and appealing definition of proximity, which has been suggested as an effective tool for the description of relations among the neighboring objects in a digital image. In this paper, an implementation algorithm based on direct calculation of the Freeman code of expanded contours is proposed for generating area Voronoi diagram of connecte...
متن کاملPower Diagrams: Properties, Algorithms and Applications
The power pow (x, s) of a point x with respect to a sphere s in Euclidean d-space E d is given by d2(x, z) 2, where d denotes the Euclidean distance function, and z and are the center and the radius of s. The power diagram of a finite set S of spheres in E d is a cell complex that associates each s S with the convex domain {x E d Ipow (x, s) < pow (x, t), for all S-{s}}. The close relationship ...
متن کاملRegion-expansion for the Voronoi diagram of 3D spheres
Given a set of spheres in 3D, constructing its Voronoi diagram in Euclidean distance metric is not easy at all even though many mathematical properties of its structure are known. This Voronoi diagram has been known for many important applications from science and engineering. In this paper, we characterize the Voronoi diagram of spheres in three-dimensional Euclidean space, which is also known...
متن کاملA provably complete exploration strategy by constructing Voronoi diagrams
We present novel exploration algorithms and a control law that enables the construction of Voronoi diagrams over unknown areas using a single vehicle equipped with range sensors. The control law uses range measurements to make the vehicle track Voronoi edges between obstacles. The exploration algorithms make decisions at vertices in the Voronoi diagram to expand the explored area until a comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphical Models
دوره 74 شماره
صفحات -
تاریخ انتشار 2012